AGSM光束在自由空间中的传输

 用矩阵方法研究了有扭曲的各向异性高斯-尔模型（AGSM）光束通过自由空间的传输。给出了光束参数的解析传输公式和详细数值计算结果，说明AGSM光束的传输特性以及扭曲因子和空间相关长度的影响。     

电场作用下反式聚乙炔中孤子输运的数值计算

对于有电场存在下的反式聚乙炔单链中的孤子运动，用SSH模型引入电场项，通过数值计算，对孤子在电场下的运动规律进行了模拟．得到孤子在电场下沿链匀速运动的结论，     

喷气Z箍缩内爆等离子体的雪铲模型

 在喷气Z pinch内爆等离子体研究中，雪铲模型是一种常用的、比较简单的物理模型。根据实验中提供的电流波形，负载线质量和初始半径，可以通过雪铲模型来估算内爆到心的时刻。根据一维运动方程和不同构形下的解析解以及部分实验结果相结合，讨论了雪铲模型的适用范围。数值计算的内爆时间和实验（Gamble II, Double EAGLE, BLACKJACK 5）测量值符合得较好。结果表明，雪铲模型在喷气Z pinch实验的负载优化设计研究中是很有参考价值的方法。     

A Novel Model for Protein Immobilization on Microspheres

The immobilization of proteins, especially receptor proteins commonly used in high through-put screening of drugs (HTS), have received great attention in recent years. There are many successful isothermal models for describing the adsorption of protein onto solid surface, such as Langmuir model, Bi-Langmuir model, Fowler model, Freundlich model, Freundlich-Langmuir model and Tekmin model etc. In all these models, Langmuir model was the most favorable one model accepted by many researchers, but the experimental results showed that it was not entirely fit to all adsorption behaviors. So new models were required for describing protein adsorption onto microspheres in different conditions.In our research, a novel isothermal model, including Langmuir and other adsorbing behaviors was presented basing on the holding degree of surface active sites and the interaction styles of protein immobilization. In Langmuir model, the adsorbing amount of protein was described as [PS] =Km[P]/1 + K[P], where [PS] was the concentration of adsorbed protein, [P] was the concentration of freeprotein at equilibrium state, and Km and K was constant. According to the interactions of protein and ligands, there were three patterns in the interactions of protein and ligands. On the similar assumption that the interaction of protein and microspheres were three styles, and based on the definition of the holding degree of surface active sites (Y), three adsorption behaviors could be described as Y K[ P ]φ/ K[P]φ+1 or ln K + φ ln[P] =ln(Y/1-Y) in which [P] was the concentration of free protein at equilibrium state, and φ and K was constant. Different scale of φ presented different adsorption behaviors, especially when φ was 1, the adsorption behavior was Langmuir adsorbing model. Figure I indicated the different adsorbing results in different adsorption behaviors (φ＞1, φ＜1,and φ=1).     

Synthesis And Properties Of Functional Ultra-High Molecular Weight Transparent Styrene-Butadiene Block Copolymer

Functional ultra-high molecular weight transparent styrene-butadiene block copolymer possesses both high transparency and impact resistance and has excellent comprehensive properties prior to other transparent resins. In this paper we not only use anionic polymerization process which includes 1 time addition of initiator and 3 time addition of monomers, but also introduce functional coupling agent for the fist time to prepare mentioned functional block copolymer. The typical preparation proces…     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.